Fault-tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation [Extended Abstract]? Danny Dolev1 , Matthias F¨ ugger2 , Christoph Lenzen1 , and Ulrich Schmid2 1

Source URL: people.mpi-inf.mpg.de

Execution Generated Test Cases: How to Make Systems Code Crash Itself Cristian Cadar and Dawson Engler? Computer Systems Laboratory Stanford University Stanford, CA 94305, U.S.A.

Source URL: www.doc.ic.ac.uk

• Constraint programming
• Abstract interpretation
• Symbolic execution
• Software testing
• Reference
• Constraint satisfaction problem
• Const
• Parameter
• Concolic testing
• Constraint logic programming

TERM EXTRACTION AND RAMSEY’S THEOREM FOR PAIRS ALEXANDER P. KREUZER AND ULRICH KOHLENBACH Abstract. In this paper we study with proof-theoretic methods the function(al)s provably recursive relative to Ramsey’s theore

Source URL: www.mathematik.tu-darmstadt.de

• Proof theory
• Computability theory
• Logic in computer science
• Mathematical logic
• Intuitionism
• Primitive recursive functional
• Dialectica interpretation
• Peano axioms
• Second-order arithmetic
• Reverse mathematics
• Combinatory logic
• Primitive recursive arithmetic

Dedekind-MacNeille completions of residuated lattices Joint work with A. Ciabattoni and K. Terui Nikolaos Galatos University of Denver June 6, 2009

Source URL: spot.colorado.edu

• Mathematics
• Algebra
• Abstract algebra
• Algebraic logic
• Lattice theory
• Mathematical logic
• Order theory
• Algebraic structures
• Heyting algebra
• Residuated lattice
• Boolean algebra
• DedekindMacNeille completion

A note on the Π02–induction rule∗ Ulrich Kohlenbach Fachbereich Mathematik, J.W.Goethe-Universit¨at, Robert-Mayer-Strasse 6–10, D–60054 Frankfurt, Germany Abstract It is well–known (due to C. Parsons) that th

Source URL: www.mathematik.tu-darmstadt.de

• Predicate logic
• Computability theory
• Recursion
• Logic
• Theory of computation
• Primitive recursive arithmetic
• Primitive recursive function
• Quantifier
• First-order logic
• Free variables and bound variables
• Herbrandization

COLORING THE RATIONALS IN REVERSE MATHEMATICS EMANUELE FRITTAION AND LUDOVIC PATEY Abstract. Ramsey’s theorem for pairs asserts that every 2-coloring of the pairs of integers has an infinite monochromatic subset. In th

Source URL: www.math.tohoku.ac.jp

• Logic in computer science
• Differential forms
• Combinatory logic
• Lambda calculus
• Peano axioms
• Closed and exact differential forms
• Banach fixed-point theorem
• Peetre theorem

PROOF MINING: A SYSTEMATIC WAY OF ANALYSING PROOFS IN MATHEMATICS ULRICH KOHLENBACH AND PAULO OLIVA Abstract. We call proof mining the process of logically analyzing proofs in mathematics with the aim of obtaining new i

Source URL: www.mathematik.tu-darmstadt.de

• Mathematical logic
• Quantification
• Logic
• Semantics
• Peano axioms
• Symbol
• Constructible universe
• Universal quantification
• Interpretation
• Uniform boundedness principle
• Witness
• Combinatory logic

Tutorial on Universal Algebra, Mal’cev Conditions, and Finite Relational Structures: Lecture I Ross Willard University of Waterloo, Canada BLAST 2010

Source URL: spot.colorado.edu

• Mathematical structures
• Universal algebra
• Abstract algebra
• Algebraic structures
• Mathematical logic
• Algebra
• Variety
• Boolean algebra
• F-algebra
• Structure
• Boolean algebras canonically defined
• Heyting algebra

Automatic Program Repair by Fixing Contracts? Yu Pei, Carlo A. Furia, Martin Nordio, and Bertrand Meyer Chair of Software Engineering, ETH Zurich, Switzerland Abstract. While most debuggin

Source URL: se.inf.ethz.ch

• Software engineering
• Theoretical computer science
• Formal methods
• Logic in computer science
• Computer programming
• Software testing
• Extreme programming
• Postcondition
• Software bug
• Precondition
• Assertion
• Random testing

The Friedman-Sheard programme in intuitionistic logic Graham E. Leigh and Michael Rathjen∗ March 19, 2012 Abstract

Source URL: www1.maths.leeds.ac.uk